propositional tautology

См. также в других словарях:

• Tautology (logic) — In propositional logic, a tautology (from the Greek word ταυτολογία) is a propositional formula that is true under any possible valuation (also called a truth assignment or an interpretation) of its propositional variables. For example, the… …   Wikipedia

• Propositional calculus — In mathematical logic, a propositional calculus or logic (also called sentential calculus or sentential logic) is a formal system in which formulas of a formal language may be interpreted as representing propositions. A system of inference rules… …   Wikipedia

• tautology — tautological /tawt l oj i keuhl/, tautologic, tautologous /taw tol euh geuhs/, adj. tautologically, tautologously, adv. tautologist, n. /taw tol euh jee/, n., pl. tautologies. 1. needless repetition of an idea, esp. in wo …   Universalium

• Propositional formula — In propositional logic, a propositional formula is a type of syntactic formula which is well formed and has a truth value. If the values of all variables in a propositional formula are given, it determines a unique truth value. A propositional… …   Wikipedia

• tautology — Technically, a formula of the propositional calculus that is true whatever the truth value assigned to its constituent propositional variables. (A tautology is thus valid, or true in all interpretations .) In more informal contexts a tautology is …   Philosophy dictionary

• propositional calculus — The logical calculus whose expressions are letters representing sentences or propositions, and constants representing operations on those propositions, to produce others of higher complexity. The operations include conjunction, disjunction,… …   Philosophy dictionary

• tautology — tau•tol•o•gy [[t]tɔˈtɒl ə dʒi[/t]] n. pl. gies 1) needless repetition of an idea in different words, as in “widow woman.” 2) an instance of such repetition 3) cvb pho logic a compound proposition or propositional form all of whose instances are… …   From formal English to slang

• Implicational propositional calculus — In mathematical logic, the implicational propositional calculus is a version of classical (two valued) propositional calculus which uses only one connective, called implication or conditional. In formulas, this binary operation is indicated by… …   Wikipedia

• Sequent calculus — In proof theory and mathematical logic, sequent calculus is a family of formal systems sharing a certain style of inference and certain formal properties. The first sequent calculi, systems LK and LJ, were introduced by Gerhard Gentzen in 1934 as …   Wikipedia

• Boolean algebra — This article discusses the subject referred to as Boolean algebra. For the mathematical objects, see Boolean algebra (structure). Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought,[1] is a… …   Wikipedia

• Boolean algebra (introduction) — Boolean algebra, developed in 1854 by George Boole in his book An Investigation of the Laws of Thought , is a variant of ordinary algebra as taught in high school. Boolean algebra differs from ordinary algebra in three ways: in the values that… …   Wikipedia